Eléments de l'association
|
List of bibliographic references
Number of relevant bibliographic references: 10.Ident. | Authors (with country if any) | Title |
---|---|---|
000A69 | Hubert Comon-Lundh [France] ; Véronique Cortier [France] ; Guillaume Scerri [France] | A tool for automating the computationally complete symbolic attacker (Extended Abstract) |
001173 | Hubert Comon-Lundh [France] ; Véronique Cortier [France] ; Guillaume Scerri [France] | Tractable inference systems: an extension with a deducibility predicate |
001B98 | Hubert Comon-Lundh [France] ; Véronique Cortier [France] ; Guillaume Scerri [France] | Security proof with dishonest keys |
002426 | Hubert Comon-Lundh [France] ; Véronique Cortier [France] | How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. |
002F03 | Hubert Comon-Lundh [France] ; Véronique Cortier [France] ; Eugen Zalinescu [France] | Deciding security properties for cryptographic protocols. Application to key cycles. |
003D83 | Hubert Comon-Lundh [France] ; Véronique Cortier [France] | Computational soundness of observational equivalence |
003F40 | Hubert Comon-Lundh [France] ; Véronique Cortier [France] | Computational soundness of observational equivalence |
004597 | Hubert Comon-Lundh [France] ; Véronique Cortier [France] | Computational soundness of observational equivalence |
005C23 | Hubert Comon-Lundh [France] ; Véronique Cortier [France] | Tree automata with one memory, set constraints and cryptographic protocols |
006749 | Hubert Comon-Lundh [France] ; Véronique Cortier [France] | Security properties: two agents are sufficient |
This area was generated with Dilib version V0.6.33. |